package J0121;

public class test_Queue {
    public static void main(String[] args) {
        int[] array = {1,3,4,5,6,3,2};
        minK min = new minK();
        int[] arr = min.smallestK(array,4);
    }
    public static void main1(String[] args) {
        PriorityQueue p = new PriorityQueue();
        int[] array = {3,5,2,4,6,7};
        p.createHeap(array);
        p.display();
        int step = (array.length - 1 - 1) / 2;
        //向下调整
        for (int i = step; i >= 0; i--) {
            p.shiftDown(i, array.length);
        }
        p.display();

    }
}
